Algorithm of J-factorization of Rational Matrices with Zeros and Poles on the Imaginary Axis
نویسنده
چکیده
The problem of J-factorization of rational matrices, which have zeros and poles on the imaginary axis, is reduced to construction of the solutions of two algebraic Riccati equations. For construction of these solutions, it is offered to use appropriate algorithms. These algorithms permit to find the solutions in cases when the Hamiltonian matrices, which are corresponding to these equations, have eigenvalues on the imaginary axis. Algorithms of factorization, which had been offered, permit to find the solution of the problem when the matrix, which will be factored, has zeros at infinity.
منابع مشابه
Computation of general inner-outer and spectral factorizations
In this paper we solve two problems in linear systems theory: the computation of the inner–outer and spectral factorizations of a continuous–time system considered in the most general setting. We show that these factorization problems rely essentially on solving for the stabilizing solution a standard algebraic Riccati equation of order usually much smaller than the McMillan degree of the trans...
متن کاملSpectral Factorization With Imaginary-Axis Zeros*
We examine the problem of the existence and calculation of Hermitian solutions P of a linear matrix inequality corresponding to the spectral factorization of a proper rational spectral density. In particular, zeros are permitted on the finite imaginary axis or at infinity. As part of our construction of solutions, we show explicitly that each such imaginary-axis eigenvalue, either finite or inf...
متن کاملA Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can have zeros along the imaginary axis. The key assumption is that the finite zeros of the input polynomial matrix are given as input data. The algorithm is based on numerically reliable operations only, namely computation ...
متن کاملMinimal Degree Coprime Factorization of Rational Matrices
Given a rational matrix G with complex coefficients and a domain Γ in the closed complex plane, both arbitrary, we develop a complete theory of coprime factorizations of G over Γ, with denominators of McMillan degree as small as possible. The main tool is a general pole displacement theorem which gives conditions for an invertible rational matrix to dislocate by multiplication a part of the pol...
متن کاملOn the factorization of rational matrices depending on a parameter
In 1961 Youla published his paper 'On the factorization of rational matrices'. He proved that any proper rational parahermitian matrix, positive definite on the imaginary axis can be factorized as the product of a proper rational matrix, stable with respect to the closed right half plane, and its adjoint. In this paper I prove that for any positive definite, nonstrictly proper matrix this facto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002